A double VNS heuristic for the facility location and pricing problem
نویسندگان
چکیده
In this paper we present the problem of decision making on the facility location and pricing. We assume that the facilities can charge the different prices and the objective is to maximize the overall revenue. It is known that the problem is NPhard in the strong sense even for the given facility location. A two level local search heuristic based on the VNS framework is developed for this nonlinear problem. To evaluate the global maximum, we reformulate the problem as a mixed integer linear program with additional constraints and variables. Computational results for randomly generated test instances are discussed.
منابع مشابه
Heuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems
This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملA Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier
This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...
متن کاملApplication of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems
The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...
متن کاملApproximation Methods for Solving the Equitable Location Problem with Probabilistic Customer Behavior
Location-allocation of facilities in service systems is an essential factor of their performance. One of the considerable situations which less addressed in the relevant literature is to balance service among customers in addition to minimize location-allocation costs. This is an important issue, especially in the public sector. Reviewing the recent researches in this field shows that most of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 39 شماره
صفحات -
تاریخ انتشار 2012